Independence in Computable Algebra
نویسندگان
چکیده
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and difference closed fields with the relevant notions of independence. To cover these classes of structures we introduce a new technique of safe extensions that was not necessary for the previously known results of this kind. We will then apply our techniques to derive new corollaries on the number of computable presentations of these structures. The condition also implies classical and new results on vector spaces, algebraically closed fields, torsion-free abelian groups and Archimedean ordered abelian groups.
منابع مشابه
Effectively Categorical Abelian Groups
We study effective categoricity of computable abelian groups of the form ⊕ i∈ω H, where H is a subgroup of (Q,+). Such groups are called homogeneous completely decomposable. It is well-known that a homogeneous completely decomposable group is computably categorical if and only if its rank is finite. We study ∆n-categoricity in this class of groups, for n > 1. We introduce a new algebraic concep...
متن کاملThe Independence Number Project: Α-bounds
A lower bound for the independence number of a graph is a graph invariant l such that, for every graph G, l(G) ≤ α(G). Similarly, an upper bound for the independence number is a graph invariant u such that, for every graph G, α(G) ≤ u(G). Many efficiently computable upper and lower bounds, called α-bounds here, have been published and these are surveyed in the following section. They can be use...
متن کاملLow n Boolean Subalgebras
Every lown Boolean algebra, for 1 ≤ n ≤ 4, is isomorphic to a computable Boolean algebra. It is not yet known whether the same is true for n > 4. However, it is known that there exists a low5 subalgebra of the computable atomless Boolean algebra which, when viewed as a relation on the computable atomless Boolean algebra, does not have a computable copy. We adapt the proof of this recent result ...
متن کاملOn the Triple Jump of the Set of Atoms of a Boolean Algebra
We prove the following result about the degree spectrum of the atom relation on a computable Boolean algebra. Let C be a computable Boolean algebra with infinitely many atoms and a be the Turing degree of the atom relation of C. If d is a c.e. degree such that a′′′ ≤T d′′′, then there is a computable copy of C where the atom relation has degree d. In particular, for every high3 c.e. degree d, a...
متن کاملComputable Algebra, General Theory and Theory of Computable Fields(1)
Introduction. Abstract algebra is the product of a transition from such concrete systems as the ring of integers or the field of rational numbers to the corresponding, axiomatically defined, abstract systems. In the course of this abstraction process various properties of the concrete system are lost. The field of rational numbers, for example, possesses a natural topology, an ordering, and fur...
متن کامل